منابع مشابه
extensions of some polynomial inequalities to the polar derivative
توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی
15 صفحه اولThe Complexity of Computing the Tutte Polynomial on Transversal Matroids
The complexity of computing the Tutte polynomial T(~/c,x,y) is determined for transversal matroid ,4s and algebraic numbers x and y. It is shown that for fixed x and y the problem of computing T(~,x,y) for JA a transversal matroid is ~pP-complete unless the numbers x and y satisfy (x 1)(y 1) = 1, in which case it is polynomial-time computable. In particular, the problem of counting bases in a t...
متن کاملThe Tutte Polynomial for Matroids of Bounded Branch-Width
It is a classical result of Jaeger, Vertigan and Welsh that evaluating the Tutte polynomial of a graph is #P -hard in all but few special points. On the other hand, several papers in past years have shown that the Tutte polynomial of a graph can be efficiently computed for graphs of bounded tree-width. In this paper we present a recursive formula computing the Tutte polynomial of a matroid M re...
متن کاملSome new evaluations of the Tutte polynomial
Interpretations for evaluations of the Tutte polynomial T (G;x, y) of a graph G are given at a number of points on the hyperbolae Hq = {(x, y) | (x − 1)(y − 1) = q}, for q a positive integer — points at which there are usually no other similarly meaningful graphical interpretations. Further, when q is a prime power, an alternative interpretation for the evaluation of the Tutte polynomial at (1−...
متن کاملOn the tutte polynomial of benzenoid chains
The Tutte polynomial of a graph G, T(G, x,y) is a polynomial in two variables defined for every undirected graph contains information about how the graph is connected. In this paper a simple formula for computing Tutte polynomial of a benzenoid chain is presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Combinatorics
سال: 2012
ISSN: 1687-9163,1687-9171
DOI: 10.1155/2012/430859